Channel coding method of variable length information using block code

ABSTRACT

A method for channel-coding information bits using a code generation matrix including 32 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having “A” length using basis sequences having 32-bit length corresponding to columns of the code generation matrix, and outputting the channel-coded result as an output sequence. If “A” is higher than 10, the code generation matrix is generated when (A-10) additional basis sequences were added as column-directional sequences to a first or second matrix. The first matrix is a TFCI code generation matrix composed of 32 rows and 10 columns used for TFCI coding. The second matrix is made when at least one of an inter-row location or an inter-column location of the first matrix was changed. The additional basis sequences satisfy a value 10 of a minimum Hamming distance.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.14/639,805, filed on Mar. 5, 2015, now U.S. Pat. No. 9,379,740, which isa continuation of U.S. patent application Ser. No. 14/266,615, filed onApr. 30, 2014, now U.S. Pat. No. 9,009,558, which is a continuation ofU.S. patent application Ser. No. 12/343,666, filed on Dec. 24, 2008, nowU.S. Pat. No. 8,745,459, which claims the benefit of earlier filing dateand right of priority to Korean Application No. 10-2008-0074682, filedon Jul. 30, 2008, and also claims the benefit of U.S. ProvisionalApplication No. 61/016,492, filed on Dec. 24, 2007, 61/021,337, filed onJan. 16, 2008, and 61/028,016, filed on Feb. 12, 2008, the contents ofwhich are all hereby incorporated by reference herein in their entirety.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates to a coding method for a mobilecommunication system, and more particularly to a method for effectivelyperforming a channel-coding process on information with various lengthsusing a block code.

Discussion of the Related Art

For the convenience of description and better understanding of thepresent invention, some concepts requisite for the present inventionfrom among several basic coding theories will hereinafter be describedin detail.

Generally, a general binary error correction code is denoted by [n, k,d], where “n” is the number of bits of coded codewords, “k” is thenumber of information bits created prior to the coding process, and “d”is a minimum distance between codewords. In this case, only the binarycode has been considered for the above-mentioned binary error correctioncode, such that a number of possible codeword points in code space isdenoted by 2^(n), and a total number of coded codewords is denoted by2^(k). Also, if the minimum distance is not substantially considered tobe important, the aforementioned binary error correction code may alsobe denoted by [n, k]. If there is no mention of the above errorcorrection code in this application, it should be noted that individualvalues of “n”, “k”, and “d” be set to the above-mentioned values.

In this case, the above-mentioned error correction code should not beconfused with a matrix-type block code composed of X number of rows(i.e., X rows) and Y number of columns (i.e., Y columns).

In the meantime, the coding rate R is defined as a specific valueacquired when the number of information bits is divided by the number ofbits of each codeword. In other words, the coding rate R is denoted by“k/n”, i.e., R=k/n.

Next, the Hamming distance will hereinafter be described in detail.

If two binary codes having the same number of bits include some bitshaving different bit values, the above-mentioned Hamming distance isindicative of the number of the above bits having the different bitvalues. Generally, if the Hamming distance “d” is denoted by d=2a+1, “a”number of errors can be corrected. For example, if one of two codewordsis 101011 and the other one is 110010, the Hamming distance between thetwo codewords is 3.

In the meantime, the term “minimum distance” for use in the codingtheory is indicative of a minimum value between two arbitrary codewordscontained in a code. The minimum distance is considered to be one ofcriteria to evaluate the performance of a code. The longer the distancebetween the codewords generated by the coding process, the lower theprobability of mis-detecting a corresponding codeword to be anothercodeword; as a result, the coding performance becomes better.Performance of a total code is estimated by a minimum distance betweencodewords having the worst performance. In conclusion, if a minimumdistance of a specific code is maximized, this specific code may have asuperior performance.

In the next-generation mobile communication system, control informationcarries system constituent information and transmission channelinformation, such that it is considered to be very important informationto determine a system performance. Generally, this control informationhas a short length to use a relatively small amount of system resources.The above-mentioned control information is coded by the coding techniquevery resistant to a channel error, and is then transmitted. A variety ofcoding schemes for the above control information have been considered inthe 3GPP mobile communication system, for example, a short-length blockcode based on a Reed-Muller (RM) code, a tail-biting convolution code,and a repetition code of a complex code.

In the meantime, the control information for use in the 3GPP LTE systemacting as an improved format of the above-mentioned mobile communicationsystem is coded by means of block codes, such that the block-codedcontrol information is then transmitted. In more detail, if the lengthof a transmission (Tx) information bit is “A”, the channel-codingprocess is performed by a block code composed of 20 rows and A columns(i.e., (20,A) block code) during the transmission of a specific channel(e.g., Physical Uplink Control Channel (PUCCH)), and the channel-codingresult is then transmitted. In the 3GPP LTE system, uplink controlinformation is transmitted over the PUCCH and a PUSCH (i.e., a physicaluplink shared channel). The control information transmitted over thePUSCH is channel-coded by a block code composed of 32 rows and A columns(i.e., (32,A) block code), such that the channel-coded controlinformation is then transmitted.

In the meantime, the (32,A) block code may have various formats. It isdifficult for the user to search for an optimum format after checkingindividual coding performances of each length of information bitsassociated with all block codes.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a method ofchannel-coding various lengths of information using a block code thatsubstantially obviates one or more problems due to limitations anddisadvantages of the related art.

An object of the present invention is to provide an effective (32,A)block coding method of various lengths of information. In other words,under the condition that the length of an information bit is changed invarious ways and the bit length of a coded codeword is also changed invarious ways, the present invention provides the (32,A) block codingmethod for effectively supporting the combination of various bitlengths.

In the meantime, the number of coded bits may be equal to or less than32, and the number of information bits may be changed in various ways.Therefore, according to the following embodiments of the presentinvention, the present invention provides a method for effectively usingonly some necessary parts of all the proposed block codes associatedwith the number of specific-length information bits or the number ofspecific-length coded bits. On the contrary, if the coded bits with alength longer than the above specific length are needed, the presentinvention allows the block code based on the above specific length to berepeated, such that coded bits with longer-length are obtained.

To achieve these objects and other advantages and in accordance with thepurpose of the invention, as embodied and broadly described herein, amethod for channel-coding information bits using a code generationmatrix which includes 32 rows and A columns corresponding to a length ofthe information bits, the method comprising: channel-coding theinformation bits having the length of A using basis sequences having a32-bit length corresponding to individual columns of the code generationmatrix, and outputting the channel-coded result as an output sequence,in which if the A value is higher than “10”, the code generation matrixis generated when (A-10) number of additional basis sequences from amongseveral additional basis sequences were added as column-directionalsequences to a first or second matrix, in which the first matrixcorresponds to a Transport Format Combination Indicator (TFCI) codegeneration matrix information composed of 32 rows and 10 columns usedfor coding TFCI information, the second matrix is made when at least oneof the order of rows of the first matrix and the order of columns of thefirst matrix was changed, and the additional basis sequences satisfy apredetermined condition in which a value of a minimum Hamming distanceis 10.

Preferably, the additional basis sequence includes 10 number of “0”values.

Preferably, the second matrix is made when at least one of the order ofrows of the first matrix and the order of columns of the first matrixwas changed, and includes lower 12 rows to be deleted to generate athird matrix, such that the third matrix corresponds to another codegeneration matrix for Physical Uplink Control CHannel (PUCCH)transmission.

In another aspect of the present invention, there is provided a methodfor channel-coding information bits using a code generation matrix whichincludes 32 rows and A columns corresponding to a length of theinformation bits, the method comprising: channel-coding the informationbits having the length of A using basis sequences having a 32-bit lengthcorresponding to individual columns of the code generation matrix, andoutputting the channel-coded result as an output sequence, in which ifthe A value is higher than “10”, the code generation matrix is generatedwhen (A-10) number of additional basis sequences from among severaladditional basis sequences were added as column-directional sequences toa first or second matrix, in which the second matrix is made when atleast one of the order of rows of the first matrix and the order ofcolumns of the first matrix was changed, the first matrix is representedby the following Table,

TABLE i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 2 1 0 0 1 00 1 0 1 1 3 1 0 1 1 0 0 0 0 1 0 4 1 1 1 1 0 0 0 1 0 0 5 1 1 0 0 1 0 1 11 0 6 1 0 1 0 1 0 1 0 1 1 7 1 0 0 1 1 0 0 1 1 0 8 1 1 0 1 1 0 0 1 0 1 91 0 1 1 1 0 1 0 0 1 10 1 0 1 0 0 1 1 1 0 1 11 1 1 1 0 0 1 1 0 1 0 12 1 00 1 0 1 0 1 1 1 13 1 1 0 1 0 1 0 1 0 1 14 1 0 0 0 1 1 0 1 0 0 15 1 1 0 01 1 1 1 0 1 16 1 1 1 0 1 1 1 0 0 1 17 1 0 0 1 1 1 0 0 1 0 18 1 1 0 1 1 11 1 0 0 19 1 0 0 0 0 1 1 0 0 0 20 1 0 1 0 0 0 1 0 0 0 21 1 1 0 1 0 0 0 00 1 22 1 0 0 0 1 0 0 1 1 0 23 1 1 1 0 1 0 0 0 1 1 24 1 1 1 1 1 0 1 1 1 125 1 1 0 0 0 1 1 1 0 0 26 1 0 1 1 0 1 0 0 1 1 27 1 1 1 1 0 1 0 1 1 1 281 0 1 0 1 1 1 0 1 0 29 1 0 1 1 1 1 1 1 1 0 30 1 1 1 1 1 1 1 1 1 1 31 1 00 0 0 0 0 0 0  0,and the several additional basis sequences are equal to

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1,0, 1, 0, 1, 1, 1, 0, 0],

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1,0, 1, 0, 0, 0, 0, 1, 0],

[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0,1, 1, 0, 0, 0, 1, 1, 0], and

[0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1,0, 0, 1, 0, 1, 0, 0, 1], respectively.

In another aspect of the present invention, there is provided a methodfor channel-coding information bits using a code generation matrix whichincludes 32 rows and A columns corresponding to a length of theinformation bits, the method comprising: channel-coding the informationbits having the length of A using basis sequences having a 32-bit lengthcorresponding to individual columns of the code generation matrix, andoutputting the channel-coded result as an output sequence, in which thecode generation matrix corresponds to a tenth matrix having 32 rows andA columns, in which a fourth matrix corresponds to a matrix composed of20 rows and A columns in which A number of basis sequences weresequentially selected from a left side of a fifth matrix represented bythe following table

TABLE i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 1 1 0 0 0 0 0 0 00 1 1 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 1 31 0 1 1 0 0 0 0 1 0 1 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 1 5 1 1 0 0 1 01 1 1 0 1 1 1 0 6 1 0 1 0 1 0 1 0 1 1 1 1 1 0 7 1 0 0 1 1 0 0 1 1 0 1 11 1 8 1 1 0 1 1 0 0 1 0 1 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 1 10 1 0 10 0 1 1 1 0 1 1 1 1 1 11 1 1 1 0 0 1 1 0 1 0 1 1 1 1 12 1 0 0 1 0 1 0 11 1 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 1 1 1 14 1 0 0 0 1 1 0 1 0 0 1 0 11 15 1 1 0 0 1 1 1 1 0 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 1 1 1 17 1 0 01 1 1 0 0 1 0 0 1 1 1 18 1 1 0 1 1 1 1 1 0 0 0 0 0 1 19 1 0 0 0 0 1 1 00 0 0 0 0  1,and a sixth matrix is a matrix made when at least one of the order ofrows of the first matrix and the order of columns of the fourth matrixwas changed, and a seventh matrix is a matrix made when additional 12bits were added to each of basis sequences of the fourth or the sixthmatrix, in which the seventh matrix corresponds to a matrix composed of32 rows and A columns in which A number of basis sequences weresequentially selected from a left side of a eighth matrix represented bythe following table

TABLE I M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 1 1 0 0 0 0 0 0 00 1 1 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 1 31 0 1 1 0 0 0 0 1 0 1 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 1 5 1 1 0 0 1 01 1 1 0 1 1 1 0 6 1 0 1 0 1 0 1 0 1 1 1 1 1 0 7 1 0 0 1 1 0 0 1 1 0 1 11 1 8 1 1 0 1 1 0 0 1 0 1 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 1 10 1 0 10 0 1 1 1 0 1 1 1 1 1 11 1 1 1 0 0 1 1 0 1 0 1 1 1 1 12 1 0 0 1 0 1 0 11 1 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 1 1 1 14 1 0 0 0 1 1 0 1 0 0 1 0 11 15 1 1 0 0 1 1 1 1 0 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 1 1 1 17 1 0 01 1 1 0 0 1 0 0 1 1 1 18 1 1 0 1 1 1 1 1 0 0 0 0 0 1 19 1 0 0 0 0 1 1 00 0 0 0 0 1 20 1 0 1 0 0 0 1 0 0 0 1 0 1 1 21 1 1 0 1 0 0 0 0 0 1 1 1 00 22 1 0 0 0 1 0 0 1 1 0 1 0 1 1 23 1 1 1 0 1 0 0 0 1 1 1 1 0 1 24 1 1 11 1 0 1 1 1 1 0 0 1 0 25 1 1 0 0 0 1 1 1 0 0 1 1 1 0 26 1 0 1 1 0 1 0 01 1 0 0 0 1 27 1 1 1 1 0 1 0 1 1 1 0 1 0 0 28 1 0 1 0 1 1 1 0 1 0 0 1 01 29 1 0 1 1 1 1 1 1 1 0 0 1 1 0 30 1 1 1 1 1 1 1 1 1 1 1 0 1 0 31 1 0 00 0 0 0 0 0 0 0 0 0  1,and a ninth matrix generated when at least one the order of rows of theseventh matrix and the order of columns of the seventh matrix waschanged, and the tenth matrix is a code generation matrix generated whenbasis sequences corresponding to the A number of the basis sequencesfrom a left side of the seventh or the ninth matrix were selected.

Preferably, if the A value is equal to or less than “14”, apredetermined number of column-directional sequences corresponding tothe A length on the basis of a left side of column-directional sequencesof a eleventh matrix sequentially correspond to the basis sequences ofthe code generation matrix, in which the eleventh matrix is representedby the following Table,

TABLE I M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 1 1 0 0 0 0 0 0 00 1 1 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 1 31 0 1 1 0 0 0 0 1 0 1 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 1 6 1 0 1 0 1 01 0 1 1 1 1 1 0 8 1 1 0 1 1 0 0 1 0 1 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 11 1 10 1 0 1 0 0 1 1 1 0 1 1 1 1 1 11 1 1 1 0 0 1 1 0 1 0 1 1 1 1 12 1 00 1 0 1 0 1 1 1 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 1 1 1 15 1 1 0 0 1 1 11 0 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 1 1 1 17 1 0 0 1 1 1 0 0 1 0 0 11 1 19 1 0 0 0 0 1 1 0 0 0 0 0 0 1 7 1 0 0 1 1 0 0 1 1 0 1 1 1 1 14 1 00 0 1 1 0 1 0 0 1 0 1 1 5 1 1 0 0 1 0 1 1 1 0 1 1 1 0 18 1 1 0 1 1 1 1 10 0 0 0 0 1 20 1 0 1 0 0 0 1 0 0 0 1 0 1 1 21 1 1 0 1 0 0 0 0 0 1 1 1 00 22 1 0 0 0 1 0 0 1 1 0 1 0 1 1 23 1 1 1 0 1 0 0 0 1 1 1 1 0 1 24 1 1 11 1 0 1 1 1 1 0 0 1 0 25 1 1 0 0 0 1 1 1 0 0 1 1 1 0 26 1 0 1 1 0 1 0 01 1 0 0 0 1 27 1 1 1 1 0 1 0 1 1 1 0 1 0 0 28 1 0 1 0 1 1 1 0 1 0 0 1 01 29 1 0 1 1 1 1 1 1 1 0 0 1 1 0 30 1 1 1 1 1 1 1 1 1 1 1 0 1 0 31 1 0 00 0 0 0 0 0 0 0 0 0 1.

Preferably, if the A value is equal to or less than “11”, apredetermined number of column-directional sequences corresponding tothe A length on the basis of a left side of column-directional sequencesof a twelfth matrix sequentially correspond to the basis sequences ofthe code generation matrix, in which the twelfth matrix is representedby the following Table,

TABLE i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) M_(i,10) 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 12 1 0 0 1 0 0 1 0 1 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 0 0 0 1 0 0 16 1 0 1 0 1 0 1 0 1 1 1 8 1 1 0 1 1 0 0 1 0 1 1 9 1 0 1 1 1 0 1 0 0 1 110 1 0 1 0 0 1 1 1 0 1 1 11 1 1 1 0 0 1 1 0 1 0 1 12 1 0 0 1 0 1 0 1 1 11 13 1 1 0 1 0 1 0 1 0 1 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 1 0 1 1 1 0 01 0 17 1 0 0 1 1 1 0 0 1 0 0 19 1 0 0 0 0 1 1 0 0 0 0 7 1 0 0 1 1 0 0 11 0 1 14 1 0 0 0 1 1 0 1 0 0 1 5 1 1 0 0 1 0 1 1 1 0 1 18 1 1 0 1 1 1 11 0 0 0 20 1 0 1 0 0 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 1 0 0 0 1 00 1 1 0 1 23 1 1 1 0 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 25 1 1 0 0 01 1 1 0 0 1 26 1 0 1 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 0 28 1 0 1 01 1 1 0 1 0 0 29 1 0 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 1 1 31 1 0 00 0 0 0 0 0 0 0.

Preferably, the method further comprises: if the number of bits (i.e., abit number) of the output sequence is at least 32 (i.e., at least 32bits), repeating each basis sequence of the code generation matrix apredetermined number of times, and performing a channel coding processusing a specific part having a predetermined length corresponding to thebit number of the output sequence from among the repeated basissequence.

Preferably, if the bit number of the output sequence is higher than 32(i.e., 32 bits), the output sequence is acquired when the channel-codedresult is cyclically repeated.

Preferably, the information bit corresponds to at least one of ChannelQuality Information (CQI) and a Precoding Matrix Index (PMI).

Preferably, the output sequence is transmitted over a Physical UplinkShared Channel (PUSCH).

It is to be understood that both the foregoing general description andthe following detailed description of the present invention areexemplary and explanatory and are intended to provide furtherexplanation of the invention as claimed.

According to the above-mentioned embodiments of the present invention,the present invention reuses a code generation matrix used for TFCI(Transport Format Combination Indicator) information coding of aconventional 3GPP system and/or the (20,A) code generation matrix forPUCCH transmission, such that it can easily implement the (32,k) blockcoding. As a result, a minimum-distance between the generated codewordsincreases, resulting in an increased system performance.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention, illustrate embodiments of the inventionand together with the description serve to explain the principle of theinvention.

In the drawings:

FIG. 1 is a conceptual diagram illustrating a method for generating the(32,14) block code using the (32,10) block code used for a conventionalTFCI information coding and the (20,14) code used for PUCCH transmissionaccording to the present invention; and

FIG. 2 is a graph illustrating minimum-distance performances acquiredwhen the (40,k) block code, the (52,k) block code, and the (64,k) blockcode are generated on the condition that the (20,k) block code and the(32,k) block code are used as base codes.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the preferred embodiments of thepresent invention, examples of which are illustrated in the accompanyingdrawings. Wherever possible, the same reference numbers will be usedthroughout the drawings to refer to the same or like parts.

Prior to describing the present invention, it should be noted that mostterms disclosed in the present invention correspond to general termswell known in the art, but some terms have been selected by theapplicant as necessary and will hereinafter be disclosed in thefollowing description of the present invention. Therefore, it ispreferable that the terms defined by the applicant be understood on thebasis of their meanings in the present invention. For example, althoughthe following description relates to a detailed example applied to the3GPP LTE (3rd Generation Partnership Project Long Term Evolution)system, the present invention can also be applied to not only the above3GPP LTE system but also other arbitrary communication systems whichneed to perform the channel coding process on various lengths of controlinformation using the block code.

For the convenience of description and better understanding of thepresent invention, general structures and devices well known in the artwill be omitted or be denoted by a block diagram or a flow chart.Wherever possible, the same reference numbers will be used throughoutthe drawings to refer to the same or like parts.

Firstly, items to be commonly considered by the present invention willhereinafter be described in detail.

The [n,k] code is a specific code in which the number of coded bits is“n” and the number of information bits is “k”.

In this case, if there is no mention in a generation matrix of eachcode, this generation matrix is represented by a basic-sequence-typetable. In fact, the coding method is similar to that of a TFCI code ofthe 3GPP release 99. In other words, the information bits aresequentially allocated to the left-sided basis sequences, and a sequencecorresponding to the product of the basis sequences and the informationbits is added by binary operations (i.e., Exclusive OR sum)corresponding to the number of information bits, such that coded bitsare generated. See Table 1, for example.

If the code is represented according to the above-mentioned method,although the number of information bits (hereinafter also referred to as“information bit number”) is various, the present invention has anadvantage in that it can perform the coding process of data on the basisof a matrix-type basis sequence table. The present invention is able tosupport a variety of information bit numbers using the above-mentionedadvantages. Therefore, a basis sequence table or a code generationmatrix is represented in consideration of a maximum-sized informationbit number. If the maximum number of information bits needed for theactual application is less than the following proposed size, it ispreferable to use a table obtained by deleting basis sequence(s) forbit(s) exceeding the maximum number of information bits from the basissequence table.

In the meantime, the operation of replacing a generation code of “0”with another generation code of “1” according to the coding theory hasno influence on the code characteristics. Therefore, although the valueof “0” is replaced with the other value of “1” in the basis sequencetable, the replaced result may indicate the same code feature. Also,although the order of coded bits is replaced with another orderaccording to the coding theory, the replaced result may also indicatethe same code feature. Therefore, although the row location is replacedwith another row location in the basis sequence table, the replacedresult may also indicate the same code feature.

The basis sequence proposed by the following embodiments is designed tohave a various number of information bits (i.e., a variousinformation-bit number), and is also designed to have a various numberof coded bits (i.e., a various coded bit number). Therefore, in the caseof devising the inventive concept of the present invention, a specificcode in which a specific column is deleted from a specific basissequence table was pre-considered. For example, if a basis sequencetable is denoted by a specific format such as (32,14), the(20,11)-format basis sequence table is one of application examples ofthe above (32,14)-format basis sequence table. In more detail, if 12columns are successively deleted from the bottom of the (32,14)-formatbasis sequence table, and 3 rows are deleted from the right of the(32,14)-format basis sequence table, the above-mentioned (20,11)-formatbasis sequence table can be acquired. In brief, the row and column ofthe basis sequence table according to the present invention have beendecided on the basis of the largest size. In the case of the small-sizedrow and column, the rows and columns of the largest-sized basis sequencetable are sequentially deleted from the right or the bottom of the abovetable, such that the deleted result is used. Needless to say, aspreviously stated above, although the row location may be replaced withthe column location in the smaller-sized basis sequence table, oralthough the location of “0” is replaced with the other location of “1”in the basis sequence table, the above replaced results may have thesame codes.

For the convenience of description and better understanding of thepresent invention, in the case of indicating the order of any data ofthe present invention, the information bits sequentially proceed in thedirection from the left column to the right column in the above basissequence table. The coded bits sequentially proceed in the directionfrom the uppermost row to the lowermost row in the above basis sequencetable. The term “basis sequence table” may also be called “Codegeneration matrix” or other terms as necessary.

In the meantime, it is preferable that a specific-pattern basis sequencefor use in a specific channel estimation method be unavailable. In thiscase, a specific table, from which a specific basis sequence based on asystem type is removed, may be selected from various tables proposed bythe following embodiments. From the viewpoint of the coding process, acorresponding basis sequence may always be considered to be “0”, suchthat the same coding performance is made, but only the number ofinformation bits is reduced.

Therefore, according to the basis sequence table proposed by thefollowing embodiments, a specific basis sequence table having nospecific basis sequence or a code generation matrix has already beenconsidered in the case of designing the present invention.

According to the above-mentioned one aspect of the present invention,the present invention provides the (32,A)-format block coding method. Inmore detail, the present invention provides the (32,14)-format blockcoding method in consideration of the maximum length (i.e., 14 bits) ofinformation bits. However, it should be noted that only some basissequences from among the (32,14)-format code generation matrix be usedaccording to the information-bit length as previously stated above.

Although a variety of methods can be used for the above-mentionedpurposes, the following embodiments provide a code design method capableof maintaining a maximum common point with conventional codes using theconventional block codes. In more detail, the conventional codes providea first method of using the (32,10)-format block code for theTFCI-information coding used in the 3GPP release 99 and a second methodof using the (20,14)-format block code for PUCCH transmission. In thiscase, the above-mentioned (20,14)-format block code has been disclosedin U.S. Provisional Application No. 61/016,492 used as priority of thepresent invention, entitled “GENERATION METHOD OF VARIOUS SHORT LENGTHBLOCK CODES WITH NESTED STRUCTURE BY PUNCTURING A BASE CODE” filed bythe same applicant as the present invention, which is incorporatedherein by reference. Detailed descriptions of the (32,10)-format blockcode and the (20,14)-format block code will hereinafter be described indetail.

The (32,10)-format block code for the TFCI information coding and the(20,14)-format block code for PUCCH transmission will hereinafter bedescribed in detail.

(32,10) TFCI Block Code and (20,14) Block Code

The (20,14) block code for use in this embodiment will be generated asfollows. Firstly, (20,10) block code is generated from the(32,10)-structured TFCI code generation matrix, and 4 basis sequencesare added to the (20,10) block code, such that the (20,14) block code isgenerated.

The (20,10) block code is based on the (32,10)-code generation matrixused for the channel coding of TFCI (Transport Format CombinationIndicator) information in the 3GPP Rel'99. As a result, the (20,10)block code can be designed to be punctured according to the length of acodeword to be coded.

The reuse of the (32,10) TFCI information code has a variety ofadvantages. For example, the TFCI information code has been designed onthe basis of the Reed-Muller (RM) code, such that the punctured TFCIcode may have a modified Reed-Muller (RM) code structure. ThisReed-Muller (RM)-based code has an advantage in that it can be quicklydecoded by a fast Hadamard transform method during the decoding process.For another example, the TFCI coding method supports a various-lengthinformation and coded bits with various lengths. In this way, theinformation-bit length or the coded-bit length can be changed in variousways, such that requirements for CQI transmission of the 3GPP LTE can bewell satisfied.

The following Table 1 shows the (32,10)-code generation matrix used forthe channel coding of TFCI information in the 3GPP Rel'99. In this case,the (32,10)-code generation matrix generates a specific codeword whichhas the length of 32 bits and the value of d_(min)=12.

TABLE 1 TFCI Index M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5)M_(i,6) M_(i,7) M_(i,8) M_(i,9) 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 1 00 0 2 1 1 0 0 0 1 0 0 0 1 3 0 0 1 0 0 1 1 0 1 1 4 1 0 1 0 0 1 0 0 0 1 50 1 1 0 0 1 0 0 1 0 6 1 1 1 0 0 1 0 1 0 0 7 0 0 0 1 0 1 0 1 1 0 8 1 0 01 0 1 1 1 1 0 9 0 1 0 1 0 1 1 0 1 1 10 1 1 0 1 0 1 0 0 1 1 11 0 0 1 1 01 0 1 1 0 12 1 0 1 1 0 1 0 1 0 1 13 0 1 1 1 0 1 1 0 0 1 14 1 1 1 1 0 1 11 1 1 15 1 0 0 0 1 1 1 1 0 0 16 0 1 0 0 1 1 1 1 0 1 17 1 1 0 0 1 1 1 0 10 18 0 0 1 0 1 1 0 1 1 1 19 1 0 1 0 1 1 0 1 0 1 20 0 1 1 0 1 1 0 0 1 121 1 1 1 0 1 1 0 1 1 1 22 0 0 0 1 1 1 0 1 0 0 23 1 0 0 1 1 1 1 1 0 1 240 1 0 1 1 1 1 0 1 0 25 1 1 0 1 1 1 1 0 0 1 26 0 0 1 1 1 1 0 0 1 0 27 1 01 1 1 1 1 1 0 0 28 0 1 1 1 1 1 1 1 1 0 29 1 1 1 1 1 1 1 1 1 1 30 0 0 0 00 1 0 0 0 0 31 0 0 0 0 1 1 1 0 0 0

In Table 1, the information bits are mapped to respective columns, andthe leftmost column among these columns is an “LSB” in the mapping orderof the information bits. In other words, if the number of informationbits is 4, only 4 columns from the left side is used, such that theinformation bits are mapped to 4 columns, i.e., [M_(i,0), M_(i,1),M_(i,2), M_(i,3)]. In this case, respective coded bits from the upperrow are mapped to LSBs. In more detail, if information bits are mappedto as many columns as the length of the information bits in Table 1. Thepresent invention performs a binary operation in which columns of thebasis sequence are multiplied by the respective information bits, suchthat it can finally perform the coding process. Detailed descriptions ofthe above-mentioned operation will be shown by referring to thefollowing equation. The k number of information bits are sequentiallymapped to a₀, a₁, . . . , a_(k) (where bits from a₀ are used as LSBs).It is considered that zero (0) is mapped to a column to which theinformation bit is not mapped. In this case, the i-th bit (b_(i)) of theoutput codeword can be calculated by the following equation.

$\begin{matrix}{{b_{i} = {\sum\limits_{n = 0}^{9}\;{( {a_{n} \times M_{i,n}} ){mod}\mspace{14mu} 2}}},} & \lbrack {{Equation}\mspace{14mu} 4} \rbrack\end{matrix}$

where i=0, . . . , 31.

Generally, as well known in the art, although the order of rows or theorder of columns is changed in the block code, there is no difference inperformance between the generated codewords. The following Table 2 showsa specific block code, which is equivalent to the (32,10) block codeused for the aforementioned TFCI-information coding using theabove-mentioned advantage.

TABLE 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 g_(10by32)[1] 1 0 1 0 1 01 0 1 0 1 0 1 0 1 0 g_(10by32)[2] 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0g_(10by32)[3] 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 g_(10by32)[4] 1 1 1 1 1 11 1 0 0 0 0 0 0 0 0 g_(10by32)[5] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1g_(10by32)[6] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 g_(10by32)[7] 1 1 1 0 1 11 0 0 0 0 0 1 1 1 1 g_(10by32)[8] 1 1 1 0 0 0 1 1 1 0 1 1 0 1 1 0g_(10by32)[9] 1 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 g_(10by32)[10] 1 0 0 0 1 01 0 1 1 1 1 0 1 0 0 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32g_(10by32)[1] 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 g_(10by32)[2] 1 1 0 0 1 10 0 1 1 0 0 1 1 0 0 g_(10by32)[3] 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0g_(10by32)[4] 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 g_(10by32)[5] 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 g_(10by32)[6] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1g_(10by32)[7] 1 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 g_(10by32)[8] 1 0 1 1 0 01 1 1 0 0 0 0 0 0 0 g_(10by32)[9] 1 0 0 1 1 1 1 1 0 1 0 1 0 0 0 0g_(10by32)[10] 1 1 1 0 1 1 0 0 0 0 1 1 1 0 0 0

As can be seen from the block code shown in Table 2, the row- andcolumn-locations of the (32,10) code used for the TFCI coding arechanged to other locations, and locations of some columns (or locationsof some rows on the basis of the TFCI information code) are exchangedwith each other.

In other words, according to this embodiment of the present invention,12 rows in either the (32,10)-format TFCI information code (Table 1) orits equivalent matrix (Table 2) may be punctured, or 20 rows areselected from the (32,10)-format TFCI information code (Table 1) or itsequivalent matrix (Table 2), such that the (20,10) block code isconfigured. In this case, from the viewpoint of the block code of Table2, 12 columns may be punctured, and 20 columns may be selected. There isno difference in mode performance between the first case of using Table1 and the second case of using Table 2. For the convenience ofdescription and better understanding of the present invention, it isassumed that the present invention uses the equivalent format (See Table2) of the TFCI information code if there is no mention in theabove-mentioned description.

In the meantime, the (32,10) code used for coding the TFCI informationhas been generated on the basis of the Reed-Muller (RM) code. In thiscase, in order to implement an error correction performance, it is veryimportant to search for a puncturing pattern which enables a codeword tohave the longest distance (d_(min)).

Compared with this embodiment, an exhaustive search capable of searchingfor an optimum puncturing pattern in a generation matrix of the (32,10)code used for TFCI coding will hereinafter be described in detail.Provided that the number of columns of a generation matrix to bepunctured in the (32×10) matrix (also denoted by (32*10) matrix) is setto “p”, the number of all available puncturing patterns is denoted by

$\begin{pmatrix}32 \\p\end{pmatrix}.$In this case,

$\begin{pmatrix}32 \\p\end{pmatrix}\quad$is indicative of the number of cases, each of which selects the pcolumns from among 32 columns.

For example, if the value of “p” is 12 (p=12), there are different(10×20) generation matrixes (i.e.,

$\begin{pmatrix}32 \\12\end{pmatrix} = {225\text{,}792\text{,}840}$number of (10×20) generation matrixes), 10-bit information (i.e.,2₁₀=1,024 number of information segments) is coded into a codeword of 20bits. A minimum Hamming distance (d_(min)) between codewords generatedby individual matrixes is calculated, such that a generation matrixhaving the highest value is found in the above minimum Hamming distance(d_(min)). If a puncturing pattern is used to make the generation matrixhaving the maximum (d_(min)) value, this puncturing pattern isconsidered to be the last pattern to be finally found. However, thegeneration of the optimum (20,10) block code on the basis of the abovesteps requires a large number of calculations, resulting in greaterinconvenience of use.

Therefore, this embodiment of the present invention adds specificrestriction conditions to the process for deciding the puncturingpattern, such that it reduces the range of a searching space foracquiring an optimum (d_(min)) value.

Next, a method for more effectively searching for a generation matrix ofthe (20,10) code which generates a codeword having d_(min)=d willhereinafter be described in detail. Provided that a target (d_(min))value is denoted by d, the Hamming weight w(g_(10by20)[i]) of each rowvector g_(10by20)[i] (1≦i≦10) of the (20,10)-code generation matrix hassome requirements shown in the following Equation 1.d≦w(g _(10by20) [i])≦20−d  [Equation 1]

i=0, 1, . . . , 10

i≠6 (There are all ones in this row vector)

For example, if the value of d is 6 (d=6), Equation 1 can be representedby the following Equation 2.6≦w(g _(10by20) [i])≦14  [Equation 2]

Therefore, if the above restriction of Equation 2 is added to individualrow vectors g_(10by20)[i] of the (10*20) matrix generated from theabove-mentioned exhaustive search process, the added result can reducethe number

$( {N{\operatorname{<<}\begin{pmatrix}32 \\12\end{pmatrix}}} )$of searching spaces capable of searching for a generation matrixgenerating a codeword having d_(min)=6. Generally, based on variouscited references, it is well known in the art that a maximum (d_(min))value of the (20,10) code is 6, and its detailed description has beendisclosed in “The Theory of Error-Correcting Codes (by F. J. MacWilliamsand N. J. A. Sloane)”. Therefore, the condition of d_(min)=6 is appliedto the condition of Equation 1, such that 360 patterns indicating anoptimum performance can be found.

The above 360 puncturing patterns have been disclosed in Appendix “A” ofU.S. Provisional Application No. 61/016,492, entitled “GENERATION METHODOF VARIOUS SHORT LENGTH BLOCK CODES WITH NESTED STRUCTURE BY PUNCTURINGA BASE CODE” filed by the same applicant as the present invention.Specifically, indexes of punctured columns based on Table 2 have beendisclosed in the Appendix “A”. For the convenience of description, theabove-mentioned indexes will herein be omitted.

The following pattern from among the above 360 puncturing patterns willhereinafter be described as an example.

The following Table 3 shows a specific pattern, which indicates thedistribution of a specific Hamming weight from among the 360 patterns.

TABLE 3 10 × 32 matrix 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Table 2 00 1 1 1 0 1 1 0 0 1 1 1 1 0 1 10 × 32 matrix 17 18 19 20 21 22 23 24 2526 27 28 29 30 31 32 Table 2 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 0

The puncturing patterns shown in Table 3 correspond to the sixth indexof Table A.2 of the Appendix “A” of U.S. Provisional Application No.61/016,492. In this case, the value “0” of Table 3 indicates that acolumn corresponding to the location of “0” is punctured. The value “1”of Table 3 indicates that a column corresponding to the location of “1”is not punctured but selected for the (20,10) block code.

In the case where the puncturing pattern of Table 3 is applied to Table2, the result is shown as the following Table 4.

TABLE 4 puncturing Index M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5)M_(i,6) M_(i,7) M_(i,8) M_(i,9) for (20,10) 0 1 1 1 1 1 1 1 1 1 1Punctured 1 0 1 1 1 1 1 1 1 1 0 Punctured 2 1 0 1 1 1 1 1 1 0 0 3 0 0 11 1 1 0 0 1 0 4 1 1 0 1 1 1 1 0 0 1 5 0 1 0 1 1 1 1 0 1 0 Punctured 6 10 0 1 1 1 1 1 0 1 7 0 0 0 1 1 1 0 1 0 0 8 1 1 1 0 1 1 0 1 1 1 Punctured9 0 1 1 0 1 1 0 0 1 1 Punctured 10 1 0 1 0 1 1 0 1 0 1 11 0 0 1 0 1 1 01 1 1 12 1 1 0 0 1 1 1 0 1 0 13 0 1 0 0 1 1 1 1 0 1 14 1 0 0 0 1 1 1 1 00 Punctured 15 0 0 0 0 1 1 1 0 0 0 16 1 1 1 1 0 1 1 1 1 1 Punctured 17 01 1 1 0 1 1 0 0 1 18 1 0 1 1 0 1 0 1 0 1 19 0 0 1 1 0 1 0 1 1 0 20 1 1 01 0 1 0 0 1 1 Punctured 21 0 1 0 1 0 1 1 0 1 1 22 1 0 0 1 0 1 1 1 1 0 230 0 0 1 0 1 0 1 1 0 Punctured 24 1 1 1 0 0 1 0 1 0 0 25 0 1 1 0 0 1 0 01 0 26 1 0 1 0 0 1 0 0 0 1 Punctured 27 0 0 1 0 0 1 1 0 1 1 28 1 1 0 0 01 0 0 0 1 29 0 1 0 0 0 1 1 0 0 0 Punctured 30 1 0 0 0 0 1 0 0 0 0 31 0 00 0 0 1 0 0 0 0 Punctured

In this case, compared with Table 2, row- and column-directions of Table4 are changed, but Table 4 has the same meaning as Table 2. 12 puncturedrows from among individual row-directional sequences are shown at theright side of Table 4. As a result, the generated (20,10) block code canbe represented by Table 4.

TABLE 5 Index M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) 2 1 0 1 1 1 1 1 1 0 0 3 0 0 1 1 1 1 0 0 1 0 4 11 0 1 1 1 1 0 0 1 6 1 0 0 1 1 1 1 1 0 1 7 0 0 0 1 1 1 0 1 0 0 10 1 0 1 01 1 0 1 0 1 11 0 0 1 0 1 1 0 1 1 1 12 1 1 0 0 1 1 1 0 1 0 13 0 1 0 0 1 11 1 0 1 15 0 0 0 0 1 1 1 0 0 0 17 0 1 1 1 0 1 1 0 0 1 18 1 0 1 1 0 1 0 10 1 19 0 0 1 1 0 1 0 1 1 0 21 0 1 0 1 0 1 1 0 1 1 22 1 0 0 1 0 1 1 1 1 024 1 1 1 0 0 1 0 1 0 0 25 0 1 1 0 0 1 0 0 1 0 27 0 0 1 0 0 1 1 0 1 1 281 1 0 0 0 1 0 0 0 1 30 1 0 0 0 0 1 0 0 0 0

In the meantime, there is a little difference between the order of rowsof Table 4 or Table 5 and the matrix order of the 3GPP-based TFCIcoding. As described above, although the location of each row is changedto another location according to the above-mentioned coding theory,there is no difference in performance between generated codewords. Ifthe row order of Table 4 or Table 5 is adjusted in the same manner as inthe TFCI code matrix, the following Table 6 is acquired.

TABLE 6 Table 4 TFCI Puncturing Index Index M_(i,0) M_(i,1) M_(i,2)M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7) M_(i,8) M_(i,9) for (20,10) 30 01 0 0 0 0 1 0 0 0 0 29 1 0 1 0 0 0 1 1 0 0 0 Punctured 28 2 1 1 0 0 0 10 0 0 1 27 3 0 0 1 0 0 1 1 0 1 1 26 4 1 0 1 0 0 1 0 0 0 1 Punctured 25 50 1 1 0 0 1 0 0 1 0 24 6 1 1 1 0 0 1 0 1 0 0 23 7 0 0 0 1 0 1 0 1 1 0Punctured 22 8 1 0 0 1 0 1 1 1 1 0 21 9 0 1 0 1 0 1 1 0 1 1 20 10 1 1 01 0 1 0 0 1 1 Punctured 19 11 0 0 1 1 0 1 0 1 1 0 18 12 1 0 1 1 0 1 0 10 1 17 13 0 1 1 1 0 1 1 0 0 1 16 14 1 1 1 1 0 1 1 1 1 1 Punctured 14 151 0 0 0 1 1 1 1 0 0 Punctured 13 16 0 1 0 0 1 1 1 1 0 1 12 17 1 1 0 0 11 1 0 1 0 11 18 0 0 1 0 1 1 0 1 1 1 10 19 1 0 1 0 1 1 0 1 0 1 9 20 0 1 10 1 1 0 0 1 1 Punctured 8 21 1 1 1 0 1 1 0 1 1 1 Punctured 7 22 0 0 0 11 1 0 1 0 0 6 23 1 0 0 1 1 1 1 1 0 1 5 24 0 1 0 1 1 1 1 0 1 0 Punctured4 25 1 1 0 1 1 1 1 0 0 1 3 26 0 0 1 1 1 1 0 0 1 0 2 27 1 0 1 1 1 1 1 1 00 1 28 0 1 1 1 1 1 1 1 1 0 Punctured 0 29 1 1 1 1 1 1 1 1 1 1 Punctured31 30 0 0 0 0 0 1 0 0 0 0 Punctured 15 31 0 0 0 0 1 1 1 0 0 0

As described above, only the row order of Table 6 is different from thatof Table 4, but the remaining features of Table 6 are exactly equal tothose of Table 4. The representation method of Table 6 has an advantagein that the last 2-bits be punctured during the puncturing time from the(20,10) code to the (18,10) code.

Next, a method for extending the above-mentioned (20,10) code to amaximum of the (20,14) code will hereinafter be described in detail.

As for the (20,A) block code according to this embodiment, it is assumedthat a CQI value indicating channel quality information (CQI) of the3GPP LTE system be applied to the channel coding method for PUCCHtransmission. Also, in the case of generating the (20,10) code, the bitnumber of the CQI information of the 3GPP LTE system can be decided inthe range from 4 bits to 10 bits, such that it can be maximally extendedto the (20,10) block code. However, in the case of the MIMO system, thebit number of the CQI information may be higher than 10 bits asnecessary. However, a transmission (Tx) amount of actual CQI is decidedaccording to a CQI generation method. For the coding process, thepresent invention may consider a method for supporting all theinformation bit numbers ranging from 4 bits to 14 bits.

Therefore, the (20,14) block coding method will hereinafter bedescribed, which is capable of supporting a maximum of 14 bits by addinga column to the above (20,10) block code.

In order to search for the added column during the exhaustive search, alarge number of calculations must be carried out. Therefore, theexecution of the exhaustive search in all the cases may be ineffectiveor undesirable.

In this step, it should be noted that the sixth column of Table 6 is setto “1” and is used as a basis sequence. Therefore, if the added columnmust satisfy the minimum distance “d”, a minimum number of “0” must beequal to or higher than “d”. In this example, the number of “0” is equalto a minimum distance between codewords. In more detail, a differencebetween the added column and the old sixth column composed of “1” isindicative of a distance between two codewords, such that the number of“0” contained in the added column is equal to the distance betweencodewords.

Generally, a maximum of a minimum distance available for the (20,10)code is 6. In the present invention, a minimum of a maximum distanceavailable for the (20,11) code corresponding to an extended version ofthe (20,10) code is 4. In more detail, the maximum-/minimum-distancecharacteristics based on various information bit numbers of the 20-bitcodeword can be represented by Table 7.

TABLE 7 k n 4 5 6 7 8 9 10 11 12 13 14 20 8 8 8 6 6 6 6 4 4 4 4

Therefore, this embodiment of the present invention provides a columnadding method, which allows the maximum-/minimum-distance of the addedcolumn to be “4”. According to this column adding method, a columnhaving at least four “0” values is added to the added column.

In order to minimize the number of searching times, it is assumed thatthe added column of this embodiment includes 4 number of “0” values(i.e., four “0” values). In this way, if the added column includes thefour “0” values and 16 number of “1” values, this added column can beconfigured in various ways. A representative example of the added columnis shown in the following Table 8. If the (20,10) code of Table 6 isextended to the (20,14) code, Table 8 can be acquired.

TABLE 8 i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 1 0 0 0 01 0 0 0 0 1 1 0 0 2 1 1 0 0 0 1 0 0 0 1 1 1 0 0 3 0 0 1 0 0 1 1 0 1 1 11 1 1 5 0 1 1 0 0 1 0 0 1 0 1 1 1 1 6 1 1 1 0 0 1 0 1 0 0 1 1 1 1 8 1 00 1 0 1 1 1 1 0 1 1 1 0 9 0 1 0 1 0 1 1 0 1 1 1 1 1 0 11 0 0 1 1 0 1 0 11 0 1 1 1 1 12 1 0 1 1 0 1 0 1 0 1 1 1 1 1 13 0 1 1 1 0 1 1 0 0 1 1 1 11 16 0 1 0 0 1 1 1 1 0 1 1 1 1 1 17 1 1 0 0 1 1 1 0 1 0 1 1 1 1 18 0 0 10 1 1 0 1 1 1 1 1 1 1 19 1 0 1 0 1 1 0 1 0 1 1 1 1 1 22 0 0 0 1 1 1 0 10 0 1 0 1 1 23 1 0 0 1 1 1 1 1 0 1 1 0 1 1 25 1 1 0 1 1 1 1 0 0 1 0 1 11 26 0 0 1 1 1 1 0 0 1 0 0 1 1 1 27 1 0 1 1 1 1 1 1 0 0 0 0 0 1 31 0 0 00 1 1 1 0 0 0 0 0 0 1

With reference to Table 8, the four added columns are indicative of fourcolumns located at the right side. In each added column, “0” is denotedby a bold line.

Based on the above-mentioned facts, a method for modifying or optimizingTable 8 will hereinafter be described in detail.

According to this embodiment, the sixth column of Table 8, i.e.,M_(i,5), is considered to be a basis sequence of which all bits is setto “1”. This basis sequence greatly contributes to all codewords of acorresponding bit. Therefore, from the viewpoint of the correspondingbit, the use of the basis sequence having many weights may be desirable.

However, several bits in all codewords are exclusive-OR (XOR) operated,such that their combination result must be considered. Thus, in order toreduce the number of the combination cases, the basis sequence in whicheach of all bits has the value of “1” moves to the frontmost column,resulting in the increase of a contribution rate. In this way, if datais coded under a small number of bits (i.e., a small bit number), thepresent invention may consider the above method for moving the basissequence in which each of all bits is “1” to the frontmost column, andthe moved result is represented by the following Table 9.

TABLE 9 i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 1 1 0 0 00 0 0 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 1 0 0 1 0 0 1 0 1 1 11 1 1 3 1 0 1 1 0 0 0 0 1 0 1 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 1 5 1 10 0 1 0 1 1 1 0 1 1 1 0 6 1 0 1 0 1 0 1 0 1 1 1 1 1 0 7 1 0 0 1 1 0 0 11 0 1 1 1 1 8 1 1 0 1 1 0 0 1 0 1 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 110 1 0 1 0 0 1 1 1 0 1 1 1 1 1 11 1 1 1 0 0 1 1 0 1 0 1 1 1 1 12 1 0 0 10 1 0 1 1 1 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 1 1 1 14 1 0 0 0 1 1 0 1 00 1 0 1 1 15 1 1 0 0 1 1 1 1 0 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 1 1 117 1 0 0 1 1 1 0 0 1 0 0 1 1 1 18 1 1 0 1 1 1 1 1 0 0 0 0 0 1 19 1 0 0 00 1 1 0 0 0 0 0 0 1

With reference to Table 9, a sixth sequence (i.e., each bit of the sixthsequence has the value of “1”) from among the originalcolumn-directional basis sequence moves to the location of a first basissequence, and the order of other sequences is not changed to anotherorder.

In the following description, it is assumed that the (20,14) block codestructure for PUCCH transmission uses the block code of Table 9. If thenumber of information bits for PUCCH transmission is limited to amaximum of 13 bits or less, the basis sequence located at the rightmostpart of Table 9 may be omitted as necessary, and the omitted result canbe represented by the following Table 10.

TABLE 10 i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) 0 1 1 0 0 0 0 0 0 0 01 1 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 3 1 0 1 10 0 0 0 1 0 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 5 1 1 0 0 1 0 1 1 1 0 1 11 6 1 0 1 0 1 0 1 0 1 1 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 1 1 8 1 1 0 1 1 00 1 0 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 10 1 0 1 0 0 1 1 1 0 1 1 1 111 1 1 1 0 0 1 1 0 1 0 1 1 1 12 1 0 0 1 0 1 0 1 1 1 1 1 1 13 1 1 0 1 0 10 1 0 1 1 1 1 14 1 0 0 0 1 1 0 1 0 0 1 0 1 15 1 1 0 0 1 1 1 1 0 1 1 0 116 1 1 1 0 1 1 1 0 0 1 0 1 1 17 1 0 0 1 1 1 0 0 1 0 0 1 1 18 1 1 0 1 1 11 1 0 0 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 0 0

Next, based on the above-mentioned description, a method for generatingthe (n,k) block code (where n≦32 and k≦14) will hereinafter be describedin detail.

(n, k) Block Code (n≦32, k≦14)

A block code having a maximum size of (32,14) will hereinafter bedescribed in detail. In other words, according to this embodiment, amaximum size of the coded bit number is 32, and a maximum size of theinformation bit number is 14. The coding design can be implemented invarious ways, but a coding method according to this embodiment must bedesigned to search for a maximum number of common points withconventional codes.

In order to generate the (32,14) block code, the present inventionconsiders the (20,14) block code (See Table 9) acquired from the (32,10)TFCI block code of the 3GPP Release 99, and at the same time considersthe above-mentioned (32,10) TFCI block code. In order to generate the(32,14) block code using the (20,14) block code and the (32,10) TFCIblock code, a “TBD” (To be defined) part of FIG. 1 needs to beadditionally defined.

FIG. 1 is a conceptual diagram illustrating a method for generating the(32,14) block code using the (32,10) block code used for a conventionalTFCI information coding and the (20,14) code used for PUCCH transmissionaccording to the present invention.

Referring to FIG. 1, if the (32,10) block code 101 used for the TFCIinformation coding and the (20,14) block code 102 are used to generatethe (32,14) block code 104, the TBD part 103 must be additionallydefined. In one aspect of any one of block codes, the above-mentioneddefinition can be analyzed in various ways. Namely, the (32,14) blockcode 104 according to this embodiment is generated when four basissequences (corresponding to the combination part between the 102 a partand the 103 part of FIG. 1) is added to the right side of theconventional (32,10) block code. In another aspect of the above blockcodes, 12 row-directional sequences (corresponding to the combinationpart between the 101 a part and the 103 part of FIG. 1) are added toeither the block code of Table 9 or its equivalent (20,14) block code102, such that the (32,14) block code 104 may also be generated.

In this case, the conventional TFCI information code shown in Table 1and its equivalent code can also be used as the (32,10) block code 101.The block code of Table 9 and its equivalent code can also be used asthe (20,14) block code 102. In this case, if the order of rows of theconventional block code and/or the order of columns of the conventionalblock code are/is changed, the above equivalent code is made.

Preferably, if the code is designed, the designed code must allow theTBD 103 to have the best performance at a minimum distance. Generally,according to various information-bit lengths and various coded-bitlengths, the following minimum-distance performances are acquired asshown in Table 11.

TABLE 11 k N 1 2 3 4 5 6 7 8 9 10 11 12 13 14 20 20 10 8 8 8 8 6 6 6 6 44 4 4 32 32 16 16 16 16 16 12 12 12 12 10 10 8 8

With reference to Table 11, in the case of the (32,A) block coding, if“A” is higher than “10”, a maximum value of a minimum Hamming distanceof the basis sequence is limited to “10”.

Therefore, according to a preferred embodiment of the present invention,the TBD part 103 of FIG. 1 along with the 102 a part of the (20,14)block code 102 must allow a maximum value of the minimum Hammingdistance of each basis sequence (corresponding to the combination partbetween the 102 a part and the 103 part of FIG. 1) to be “10”. In thiscase, the 102 a part corresponds to the information bits of more than 10bits. In more detail, if the number of additional basis sequences is 1or 2 (i.e., if “A” is 11 or 12), this means that one or two basissequences are added to allow a minimum Hamming distance of each basissequence to be “10”. If the number of additional basis sequences is 3 or4 (i.e., if “A” is 13 or 14), this means that three or four basissequences are added to allow a minimum Hamming distance of each basissequence to be “8”. The (32,10) block code for TFCI information codingincludes a basis sequence in which each of all components is “1”, suchthat each of the additional basis sequences may include 10 number of “0”values. In other words, if the (20,14) block code is used as the blockcode of Table 9, individual basis sequences corresponding to the 102 apart of FIG. 1 include 4 number of “0” values, such that the basissequence part corresponding to the TBD part may include 6 number of “0”values.

An example for satisfying the above-mentioned condition is shown in thefollowing Table 12.

TABLE 12 i TFCI M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 0 1 1 0 00 0 0 0 0 0 1 1 0 0 1 2 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 3 1 0 0 1 0 0 1 01 1 1 1 1 1 3 5 1 0 1 1 0 0 0 0 1 0 1 1 1 1 4 6 1 1 1 1 0 0 0 1 0 0 1 11 1 5 8 1 1 0 0 1 0 1 1 1 0 1 1 1 0 6 9 1 0 1 0 1 0 1 0 1 1 1 1 1 0 7 111 0 0 1 1 0 0 1 1 0 1 1 1 1 8 12 1 1 0 1 1 0 0 1 0 1 1 1 1 1 9 13 1 0 11 1 0 1 0 0 1 1 1 1 1 10 16 1 0 1 0 0 1 1 1 0 1 1 1 1 1 11 17 1 1 1 0 01 1 0 1 0 1 1 1 1 12 18 1 0 0 1 0 1 0 1 1 1 1 1 1 1 13 19 1 1 0 1 0 1 01 0 1 1 1 1 1 14 22 1 0 0 0 1 1 0 1 0 0 1 0 1 1 15 23 1 1 0 0 1 1 1 1 01 1 0 1 1 16 25 1 1 1 0 1 1 1 0 0 1 0 1 1 1 17 26 1 0 0 1 1 1 0 0 1 0 01 1 1 18 27 1 1 0 1 1 1 1 1 0 0 0 0 0 1 19 31 1 0 0 0 0 1 1 0 0 0 0 0 01 20 1 1 0 1 0 0 0 1 0 0 0 1 0 1 1 21 4 1 1 0 1 0 0 0 0 0 1 1 1 0 0 22 71 0 0 0 1 0 0 1 1 0 1 0 1 1 23 10 1 1 1 0 1 0 0 0 1 1 1 1 0 1 24 14 1 11 1 1 0 1 1 1 1 0 0 1 0 25 15 1 1 0 0 0 1 1 1 0 0 1 1 1 0 26 20 1 0 1 10 1 0 0 1 1 0 0 0 1 27 21 1 1 1 1 0 1 0 1 1 1 0 1 0 0 28 24 1 0 1 0 1 11 0 1 0 0 1 0 1 29 28 1 0 1 1 1 1 1 1 1 0 0 1 1 0 30 29 1 1 1 1 1 1 1 11 1 1 0 1 0 31 30 1 0 0 0 0 0 0 0 0 0 0 0 0 1

As can be seen from Table 12, if 12 rows from the bottom of Table 12 aredeleted, the (20,14) code for PUCCH transmission is formed. If 14 rowsfrom the bottom of Table 12 are deleted, the (18,14) code is formed.Various application of the information bit can be easily implemented,and as many basis sequences of Table 12 as the number of correspondinginformation bits are acquired from Table 12, such that the acquiredbasis sequences are used for the coding process. If a maximum number ofinformation bits (i.e., a maximum information-bit number) of FIG. 12 isless than 14 (i.e., 14 bits), basis sequences as many as thepredetermined number unnecessary for the basis-sequence table such asTable 9 may be deleted from the right column. This means that basissequences as many as the number of information bits required for the(32,10) block code may be added.

For example, provided that a maximum information-bit number is limitedto 11 bits, the following (32,11) block code of Table 13 can be used.

TABLE 13 i TFCI M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) 0 0 1 1 0 0 0 0 0 0 0 0 1 1 2 1 1 1 0 00 0 0 0 1 1 2 3 1 0 0 1 0 0 1 0 1 1 1 3 5 1 0 1 1 0 0 0 0 1 0 1 4 6 1 11 1 0 0 0 1 0 0 1 5 8 1 1 0 0 1 0 1 1 1 0 1 6 9 1 0 1 0 1 0 1 0 1 1 1 711 1 0 0 1 1 0 0 1 1 0 1 8 12 1 1 0 1 1 0 0 1 0 1 1 9 13 1 0 1 1 1 0 1 00 1 1 10 16 1 0 1 0 0 1 1 1 0 1 1 11 17 1 1 1 0 0 1 1 0 1 0 1 12 18 1 00 1 0 1 0 1 1 1 1 13 19 1 1 0 1 0 1 0 1 0 1 1 14 22 1 0 0 0 1 1 0 1 0 01 15 23 1 1 0 0 1 1 1 1 0 1 1 16 25 1 1 1 0 1 1 1 0 0 1 0 17 26 1 0 0 11 1 0 0 1 0 0 18 27 1 1 0 1 1 1 1 1 0 0 0 19 31 1 0 0 0 0 1 1 0 0 0 0 201 1 0 1 0 0 0 1 0 0 0 1 21 4 1 1 0 1 0 0 0 0 0 1 1 22 7 1 0 0 0 1 0 0 11 0 1 23 10 1 1 1 0 1 0 0 0 1 1 1 24 14 1 1 1 1 1 0 1 1 1 1 0 25 15 1 10 0 0 1 1 1 0 0 1 26 20 1 0 1 1 0 1 0 0 1 1 0 27 21 1 1 1 1 0 1 0 1 1 10 28 24 1 0 1 0 1 1 1 0 1 0 0 29 28 1 0 1 1 1 1 1 1 1 0 0 30 29 1 1 1 11 1 1 1 1 1 1 31 30 1 0 0 0 0 0 0 0 0 0 0

In the meantime, a method for arranging the (32,k) block code inconsideration of the (16,k) block code will hereinafter be described indetail.

A method for generating an optimum code of the (32,k) block code ofTable 12 or Table 13 is as follows. In the case of generating the (20,k)or (18,k) block code, if the remaining rows from the lowest row aredeleted, the above optimum code of the (32,k) block code can begenerated. However, if the (16,k) block code is needed, muchconsideration is needed. Therefore, according to this embodiment of thepresent invention, the row order of the above (32,k) block code ischanged in consideration of the (16,k) block code. If the (16,k) blockcode is needed, although some rows from the lowest row of the (32,k)block code are deleted and used, the present invention is able togenerate a necessary code. A representative example is shown in thefollowing Table 14.

TABLE 14 i TFCI M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) M_(i,13) 0 0 1 1 0 00 0 0 0 0 0 1 1 0 0 1 2 1 1 1 0 0 0 0 0 0 1 1 1 0 0 2 3 1 0 0 1 0 0 1 01 1 1 1 1 1 3 5 1 0 1 1 0 0 0 0 1 0 1 1 1 1 4 6 1 1 1 1 0 0 0 1 0 0 1 11 1 6 9 1 0 1 0 1 0 1 0 1 1 1 1 1 0 8 12 1 1 0 1 1 0 0 1 0 1 1 1 1 1 913 1 0 1 1 1 0 1 0 0 1 1 1 1 1 10 16 1 0 1 0 0 1 1 1 0 1 1 1 1 1 11 17 11 1 0 0 1 1 0 1 0 1 1 1 1 12 18 1 0 0 1 0 1 0 1 1 1 1 1 1 1 13 19 1 1 01 0 1 0 1 0 1 1 1 1 1 15 23 1 1 0 0 1 1 1 1 0 1 1 0 1 1 16 25 1 1 1 0 11 1 0 0 1 0 1 1 1 17 26 1 0 0 1 1 1 0 0 1 0 0 1 1 1 19 31 1 0 0 0 0 1 10 0 0 0 0 0 1 7 11 1 0 0 1 1 0 0 1 1 0 1 1 1 1 14 22 1 0 0 0 1 1 0 1 0 01 0 1 1 5 8 1 1 0 0 1 0 1 1 1 0 1 1 1 0 18 27 1 1 0 1 1 1 1 1 0 0 0 0 01 20 1 1 0 1 0 0 0 1 0 0 0 1 0 1 1 21 4 1 1 0 1 0 0 0 0 0 1 1 1 0 0 22 71 0 0 0 1 0 0 1 1 0 1 0 1 1 23 10 1 1 1 0 1 0 0 0 1 1 1 1 0 1 24 14 1 11 1 1 0 1 1 1 1 0 0 1 0 25 15 1 1 0 0 0 1 1 1 0 0 1 1 1 0 26 20 1 0 1 10 1 0 0 1 1 0 0 0 1 27 21 1 1 1 1 0 1 0 1 1 1 0 1 0 0 28 24 1 0 1 0 1 11 0 1 0 0 1 0 1 29 28 1 0 1 1 1 1 1 1 1 0 0 1 1 0 30 29 1 1 1 1 1 1 1 11 1 1 0 1 0 31 30 1 0 0 0 0 0 0 0 0 0 0 0 0 1

In Table 14, during the code conversion from the (32,k) code to the(20,k) code, if 12 rows are deleted from Table 14 on the basis of thelowest row, an optimum code is generated. If 14 rows are deleted fromTable 14 on the basis of the lowest row, the (18,k) code is generated.If 16 rows are deleted from Table 14 on the basis of the lowest row, the(16,k) code is generated.

In the meantime, based on the above-mentioned description, if a codewordof more than 32 bits is needed, the following channel coding method canbe carried out.

If Codeword of More than 32 Bits is Needed:

If the codeword of more than 32 bits is needed, the present inventionprovides a method for generating the long-length (n,k) code by repeatingthe above basis sequence on the basis of the (32,k) or (20,k) code usedas a base code.

The (32,k) or (20,k) code can be easily generated on the basis of Table12 or Table 14. In the meantime, in order to assign a stronger or highererror correction capability to a transmission (Tx) bit, the presentinvention may increase the number of coded bits (i.e., the coded bitnumber). In this case, it is preferable that a new code corresponding tothe increased number of coded bits be generated, but it is verydifficult for a code designer to design a new code whenever the numberof coded bits increases. Therefore, one of simple generation methods isto repeat the base code by a desired length. If the desired length isnot accurately represented by an integer multiple of the base code, thebase code is repeated by at least the desired length, and as many basecodes as the number of excessive bits may be removed. In this case,although the present invention is able to search for an optimumpuncturing pattern every time, the present invention can substantiallyconsider a simple puncturing method based on a rate matching block.

In this case, the present invention may consider the (32,k) or (20,k)code as the base code. For the convenience of description, the presentinvention considers only a specific case in which a desired length hasthe size of an integer multiple of the base code. In the remainingcases, it is assumed that the present invention is able to acquire anecessary code using the puncturing method. Also, the present inventionis able to use a variety of “k” values. In this case, for theconvenience of description, it is assumed that a maximum size of “k” isset to 14. Although there is no mention of the smaller size of less than14 in the present invention, it is well known to those skilled in theart that a basis sequence corresponding to a corresponding length beselected and used.

For example, if the (64,14) code is needed, the (32,14) code can berepeated only two times. If the (40,14) code is needed, the (20,14) codecan be repeated only two times. Also, the (32,14) code and the (20,14)code are simultaneously considered as the base code, such that the(32,14) code and the (20,14) code are sequentially attached to configurethe (52,14) code.

In conclusion, the combination of available codes may be determined tobe the (a*32+b*20,14) code (where “a” or “b” is an integer number of atleast “0”.

If the desired length of coded bits is not denoted by an integermultiple of the base code, the base code is repeated to be longer thanthe desired length, unnecessary parts may be severed from the end partof the longer-sized code or may be punctured using the rate matchingblocks.

In the meantime, according to another aspect of the present invention,after the order of information bits has been reversed, the base code maythen be repeated.

As described above, if the base code is continuously repeated,minimum-distance characteristics of the base code are maintained withoutany change, such that the resultant minimum-distance characteristics arerepeated. Therefore, if the code having an original minimum distance of4 is repeated two times, the minimum distance is increased by two times,such that the minimum distance of the resultant code reaches “8”.

However, provided that any variation is applied to the information bitduring the above repetition, although the information bit which forms acodeword having a minimum distance is used, a codeword generated byanother information bit changed by the above repetition is able to formanother codeword having the distance longer than the above-mentionedminimum distance. If the minimum distance is not repeated according tothe above-mentioned principles, a code can be designed such that theminimum-distance characteristics can be larger than those of a simplemultiple.

The present invention can consider a variety of methods for changing theinformation bit. For example, in order to change the above-mentionedinformation bit, a method for using a reverse version of a bit unit, anda method for allowing the information bit to pass through a randomsequence such as a PN sequence can be used in the present invention.

Also, the present invention may assign different information-bitvariations to individual repetition times, such that the information bitis differently changed whenever the repetition occurs. However, in thiscase, the complexity of a transmission/reception end increases. If therepetition is performed several times, the present invention may notchange the information bit in the first time, and may change theinformation bit in the next time.

In more detail, in the case of repeating the code according to thisembodiment, the information bit is not changed at the even-threpetition, but is changed at the odd-th repetition. In other words, thepresent invention controls the information-bit variation to be toggledwhenever the repetition occurs.

For example, under the condition that the (20,k) code and the (32,k)code are used as the base codes, the (40,k) code, the (52,k) code, andthe (64,k) code can be generated according to the present invention. Adetailed description thereof will hereinafter be described.

FIG. 2 is a graph illustrating minimum-distance performances acquiredwhen the (40,k) block code, the (52,k) block code, and the (64,k) blockcode are generated on the condition that the (20,k) block code and the(32,k) block code are used as base codes.

Referring to FIG. 2, “(40,k)_20+20” indicates that the (20,k) codeacting as the base code is repeated two times. “(20,k)_20rev” indicatesthat the information bit is reversed from the (20,k) code acting as thebase code. “(32,k)_32rev” can be analyzed in the same method as theabove-mentioned method.

“(40,k)_20+20rev” indicates that the (20,k) code used as the base codewas repeated two times, an information bit was changed according to thetoggle method at the first repetition time, and the information bit wasthen reversed at the second repetition time. In this way,“(64,k)_32+32rev” can also be analyzed in the same method as the above.In the meantime, “(52,k)_20+32rev” indicates that the (32,k) and (20,k)codes were selected as base codes, each of the selected base codes wasrepeated only once, and the (32,k) code acting as the second base codewas bit-reversed and the information bit was then applied to thebit-reverse result.

In FIG. 2, if the value of k is denoted by k≧4, the “(40,k)_20” code hasa low performance less than that of the (32,k) code. Therefore, it canbe recognized that the operation of using the (32,k) code with lessnumber of coded bits has a good performance higher than that of theoperation of repeating the (20,k) code two times. In other words, therepetition of (32,k) code with less number of coded bits has a highperformance superior to that of the repetition of (20,k) code.Therefore, the preferred embodiment of the present invention provides amethod for repeatedly using the (32,k) code during the coding processfor a long-length coded bit. In other words, according to thisembodiment of the present invention, provided that the (32,k) code wasselected as the base code, the bit number (i.e., the number of bits) ofthe last output sequence was equal to or higher than 32 (i.e., 32 bits),and an integer multiple of the base code was not implemented, the (32,k)code is repeated to be longer than a desired length, and unnecessaryparts (i.e., corresponding to the bit number of the needed outputsequence) are severed from the end of the repeated result.

The above-mentioned embodiment can be analyzed as follows. In moredetail, if the length of the needed output sequence is at least 32 bits,it can be recognized that the coded result of the (32,k) block code wascyclically repeated to acquire the above output sequence. Namely,provided that the 32-bit-length codeword, which has been channel-codedby the (32,k) block code, is represented by b₀, b₁, b₂, b₃, . . . ,b_(B-1) (where B=32), and the output sequence longer than the length of32 bits (e.g., the bit length of “Q”) is represented by g₀, q₁, g₂, g₃,. . . , g_(Q-1), the following relationship between the output sequenceand the channel-coded 32-bit-length codeword can be represented by thefollowing Equation 3.q _(i) =b _((i mod B)) where i=0,1,2, . . . ,Q−1  [Equation 3]

As can be seen from Equation 3, the output sequence component having theindex “i” corresponds to a codeword component which has an indexcorresponding to the modulo-operation result value. In this case, themodulo-operation result value is acquired when the index “i” wasmodulo-operated with the “B” value of 32. If the Q value is higher than32, the output sequence is acquired when the channel-coded sequence wascyclically repeated. This also means that the (32,k) code was repeated apredetermined number of times and the part corresponding to the lengthof a necessary codeword was selected and used. As well known to thoseskilled in the art, the above-mentioned operation results have beensubstantially equal to each other, but they have been analyzed indifferent ways.

In the meantime, as can be seen from FIG. 2, the performance of the“(52,k)_20+32rev” code is equal to or higher than that of the“(52,k)_20+32” code, and the performance of the (40,k)_20+20rev” code isequal to or higher than that of “(40,k)_20+20”. Therefore, in order toimprove the minimum-distance characteristics, the information bit isrepeated without any change at the first repetition time, and is thenreversed at the next repetition time.

Finally, if the last information bit number is not denoted by an integermultiple of the base code, the base code is repeated to be longer than adesired length, and unnecessary parts can be severed from the end partof the repeated result, or can be punctured by the rate matching blockmethod.

In the meantime, the above-mentioned method for performing the bitreversion of the information bit according to the toggle scheme can alsobe applied to not only the repetition of the above-mentioned base codebut also other repetitions of various base codes. For example, when therepetitive coding of the simplex code of ACK/NACK control information isperformed, the information bit is coded without any change at the firstrepetition time, and the bit-reversion information bit of the ACK/NACKcontrol information is then coded at the second repetition time.

It should be noted that most terminology disclosed in the presentinvention is defined in consideration of functions of the presentinvention, and can be differently determined according to intention ofthose skilled in the art or usual practices. Therefore, it is preferablethat the above-mentioned terminology be understood on the basis of allcontents disclosed in the present invention. It will be apparent tothose skilled in the art that various modifications and variations canbe made in the present invention without departing from the spirit orscope of the invention. Thus, it is intended that the present inventioncover the modifications and variations of this invention provided theycome within the scope of the appended claims and their equivalents.

That is, the present invention is not limited to only the embodimentsdescribed herein and includes the widest range equivalent to principlesand features disclosed herein.

As apparent from the above description, the channel coding methodaccording to the present invention can be easily applied to the otherchannel coding of the 3GPP LTE system which transmits CQI/PMIinformation to an uplink via a PUSCH channel. However, theabove-mentioned methods are not limited to only the above 3GPP LTEsystem, but they can also be applied to a variety of communicationschemes, each of which performs the block coding on various-lengthinformation.

What is claimed is:
 1. A method for channel-coding, by a transmittingdevice that includes a memory, a processor and a transmitter,information bits, the method comprising: channel-coding, by thetransmitting device, the information bits by using a block code togenerate encoded bits; and transmitting, by the transmitting device, theencoded bits, wherein the block code includes basis sequences M_(i,0) toM_(i,10) defined in following Table 1: TABLE 1 i M_(i,0) M_(i,1) M_(i,2)M_(i,3) M_(i,4) M_(i,5) 0 1 1 0 0 0 0 1 1 1 1 0 0 0 2 1 0 0 1 0 0 3 1 01 1 0 0 4 1 1 1 1 0 0 5 1 1 0 0 1 0 6 1 0 1 0 1 0 7 1 0 0 1 1 0 8 1 1 01 1 0 9 1 0 1 1 1 0 10 1 0 1 0 0 1 11 1 1 1 0 0 1 12 1 0 0 1 0 1 13 1 10 1 0 1 14 1 0 0 0 1 1 15 1 1 0 0 1 1 16 1 1 1 0 1 1 17 1 0 0 1 1 1 18 11 0 1 1 1 19 1 0 0 0 0 1 20 1 0 1 0 0 0 21 1 1 0 1 0 0 22 1 0 0 0 1 0 231 1 1 0 1 0 24 1 1 1 1 1 0 25 1 1 0 0 0 1 26 1 0 1 1 0 1 27 1 1 1 1 0 128 1 0 1 0 1 1 29 1 0 1 1 1 1 30 1 1 1 1 1 1 31 1 0 0 0 0 0 i M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) 0 0 0 0 0 1 1 0 0 0 1 1 2 1 0 1 1 1 3 00 1 0 1 4 0 1 0 0 1 5 1 1 1 0 1 6 1 0 1 1 1 7 0 1 1 0 1 8 0 1 0 1 1 9 10 0 1 1 10 1 1 0 1 1 11 1 0 1 0 1 12 0 1 1 1 1 13 0 1 0 1 1 14 0 1 0 0 115 1 1 0 1 1 16 1 0 0 1 0 17 0 0 1 0 0 18 1 1 0 0 0 19 1 0 0 0 0 20 1 00 0 1 21 0 0 0 1 1 22 0 1 1 0 1 23 0 0 1 1 1 24 1 1 1 1 0 25 1 1 0 0 126 0 0 1 1 0 27 0 1 1 1 0 28 1 0 1 0 0 29 1 1 1 0 0 30 1 1 1 1 1 31 0 00 0  0,

and wherein channel-coding the information bits comprises: multiplyingthe information bits a₀, a₁, a₂, a₃, . . . , a_(A-1) by the basissequences M_(i,0), M_(i,1), M_(i,2), M_(i,3), . . . , M_(i,A-1),respectively defined in Table 1; and exclusive-OR summing the multipliedinformation bits a₀*M_(i,0), a₁*M_(i,1), a₂*M_(i,2), a₃*M_(i,3), . . . ,a_(A-1)*M_(i,A-1), and wherein a number of the information bits is 11.2. The method of claim 1, wherein the encoded bits are transmitted via aphysical uplink control channel.
 3. The method of claim 1, wherein theinformation bits correspond to at least channel quality information. 4.A device for channel-coding information bits, the device comprising: amemory; a channel-coder configured to channel-code the information bitsby using a block code to generate encoded bits; and a transmitterconfigured to transmit the encoded bits, wherein the block code includesbasis sequences M_(i,0) to M_(i,10) defined in following Table 1: TABLE1 i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6) M_(i,7)M_(i,8) M_(i,9) M_(i,10) 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 12 1 0 0 1 0 0 1 0 1 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 0 0 0 1 0 0 15 1 1 0 0 1 0 1 1 1 0 1 6 1 0 1 0 1 0 1 0 1 1 1 7 1 0 0 1 1 0 0 1 1 0 18 1 1 0 1 1 0 0 1 0 1 1 9 1 0 1 1 1 0 1 0 0 1 1 10 1 0 1 0 0 1 1 1 0 1 111 1 1 1 0 0 1 1 0 1 0 1 12 1 0 0 1 0 1 0 1 1 1 1 13 1 1 0 1 0 1 0 1 0 11 14 1 0 0 0 1 1 0 1 0 0 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 1 0 1 1 1 0 01 0 17 1 0 0 1 1 1 0 0 1 0 0 18 1 1 0 1 1 1 1 1 0 0 0 19 1 0 0 0 0 1 1 00 0 0 20 1 0 1 0 0 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 1 0 0 0 1 0 01 1 0 1 23 1 1 1 0 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 25 1 1 0 0 0 11 1 0 0 1 26 1 0 1 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 0 28 1 0 1 0 11 1 0 1 0 0 29 1 0 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 1 1 31 1 0 0 00 0 0 0 0 0  0,

and wherein the channel-coder comprises: a multiplier configured tomultiply the information bits a₀, a₁, a₂, a₃, . . . , a_(A-1) by thebasis sequences M_(i,0), M_(i,1), M_(i,2), M_(i,3), . . . , M_(i,A-1),respectively defined in Table 1; and a exclusive-OR operator configuredto perform exclusive-OR sum on the multiplied information bitsa₀*M_(i,0), a₁*M_(i,1), a₂*M_(i,2), a₃*M_(i,3), . . . ,a_(A-1)*M_(i,A-1), and wherein a number of the information bits is 11.5. The device of claim 4, wherein the encoded bits are transmitted via aphysical uplink control channel.
 6. The device of claim 4, wherein theinformation bits correspond to at least channel quality information.